A complete axiom system for finite-state probabilistic processes
نویسندگان
چکیده
A complete equational axiomatization of probabilistic bisimulation for nite-state probabilistic processes is presented. It extends Milner's complete axiomatiza
منابع مشابه
Axiomatizing Probabilistic Processes: ACP with Generative Probabilities
This paper is concerned with finding complete axiomatizations of probabilistic processes. We examine this problem within the context of the process algebra ACP and obtain as our end-result the axiom system prACPi, a probabilistic version of ACP which can be used to reason algebraically about the reliability and performance of concurrent systems. Our goal was to introduce probability into ACP in...
متن کاملEquational Axioms for Probabilistic Bisimilarity
This paper gives an equational axiomatization of probabilistic bisimulation equivalence for a class of finite-state agents previously studied by Stark and Smolka ((2000) Proof, Language, and Interaction: Essays in Honour of Robin Milner, pp. 571–595). The axiomatization is obtained by extending the general axioms of iteration theories (or iteration algebras), which characterize the equational p...
متن کاملAxiomatizations for Probabilistic Finite-State Behaviors
We study a process calculus which combines both nondeterministic and probabilistic behavior in the style of Segala and Lynch’s probabilistic automata. We consider various strong and weak behavioral equivalences, and we provide complete axiomatizations for finite-state processes, restricted to guarded definitions in case of the weak equivalences. We conjecture that in the general case of unguard...
متن کاملProcess algebra with interleaving probabilistic parallel composition
In this paper we present a probabilistic version of the axiom system A CP appropriate for the (algebraic) formal description of pIobabilisti.c processes. The proposed formalism is built in a modular way, first Basic Process Algebra (prBPA) is constructed which afterwards is extended by parallel composition (prACP). Probabilities are introduced by an operator for internal probabilistic choice. I...
متن کاملComplete independence of an axiom system for central translations
A recently proposed axiom system for André’s central translation structures is improved upon. First, one of its axioms turns out to be dependent (derivable from the other axioms). Without this axiom, the axiom system is indeed independent. Second, whereas most of the original independence models were infinite, finite independence models are available. Moreover, the independence proof for one of...
متن کامل